package 二分查找;

public class LeetCode704_二分查找 {
    public int search(int[] nums, int target) {
        int len = nums.length;
        int left = 0;
        int right = len-1;

        while(left <= right) {
            int mid = left + (right-left) / 2;
            if(nums[mid] == target) {
                return mid;
            } else if(nums[mid] < target) {
                left = mid+1;
            } else {
                right = mid-1;
            }
        }
        return -1;
    }
}
